Florida 4-H Secretary Record Book

The Left Book Club: An Historical Record

The secretary returns

In the online random-arrival model, an algorithm receives a sequence of n requests that arrive in a random order. The algorithm is expected to make an irrevocable decision with regard to each request based only on the observed history. We consider the following natural extension of this model: each request arrives k times, and the arrival order is a random permutation of the kn arrivals; the al...

Matroid Secretary Problems

In 1963, Dynkin introduced the secretary problem [6]. In this problem, an algorithm is presented with n positive values, one by one. After each value, the algorithm must either accept or reject the value, where all decisions are final. The algorithm can only pick one value, and the goal is to pick the maximum value in the sequence. The name for this problem arises from a situation where n candi...

The Submodular Secretary Problem

Online auction is an essence of many modern markets, particularly networked markets, in which information about goods, agents, and outcomes is revealed over a period of time, and the agents must make irrevocable decisions without knowing future information. Optimal stopping theory, especially the classic secretary problem, is a powerful tool for analyzing such online scenarios which generally r...

The Secretary Problem

This note reanalyzes a non·zero-sum game version of the secretary problem recently treated by Kurano, Nakagami and Yasuda [3], under a modified formulation of the problem. The equilibrium derived differs from the former one and has an interesting assymptotic behavior which reconfirms a main theorem formerly proved by Presman and Sonin [4]. Th" equilibrium value in the limit is a positive number...